Parameter-dependent Parallel Block Sparse Arnoldi and Döhler Algorithms on Distributed Systems
نویسندگان
چکیده
We summarize the basics and first results of the analyses within our ZIB Bridge Project and give an outlook on further studies broadening the usage of hardware acceleration within the Finite Element Method (FEM) based solution of Maxwell’s equations. 1 Solving the Generalized Eigenvalue Problem The main focus of our project is on the solution of the eigenvalue problem originating from Maxwell’s equations in nano-optics. The basic example of such problems are so-called resonance problems [18]. These yield generalized eigenvalue problems, of which the formulation and different solution approaches are discussed in the following. We start by stating the problem and introducing a typical example, namely nanoholes in photonic crystals [1]. Furthermore, we describe three different algorithms to solve the generalized eigenvalue problem: the standard Arnoldi iteration, the recently introduced [16] and extended [8] FEAST algorithm and a Döhler algorithm [2]. 1.1 Problem Formulation In the FEM formulation [14] for Maxwell’s equations [4], we face the problem of solving the generalized eigenvalue problem:
منابع مشابه
Parallel Multilevel Block ILU Preconditioning Techniques for Large Sparse Linear Systems
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU) factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We c...
متن کاملMultiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
In this paper we propose a new approach for calculating some eigenpairs of large sparse nonHermitian matrices. This method, called Multiple Explicitly Restarted Arnoldi (MERAM), is particularly well suited for environments that combine different parallel programming paradigms. This technique is based on a multiple use of Explicitly Restarted Arnoldi method and improves its convergence. This tec...
متن کاملParallel Solution of Sparse Linear Least Squares Problemson Distributed - Memory
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملParallel Solution of Sparse Linear Least Squares Problems on Distributed-Memory Multiprocessors
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016